Backward Error Bounds for Constrained Least Squares Problems ∗
نویسندگان
چکیده
We derive an upper bound on the normwise backward error of an approximate solution to the equality constrained least squares problem minBx=d ‖b − Ax‖2. Instead of minimizing over the four perturbations to A, b, B and d, we fix those to B and d and minimize over the remaining two; we obtain an explicit solution of this simplified minimization problem. Our experiments show that backward error bounds of practical use are obtained when B and d are chosen as the optimal normwise relative backward perturbations to the constraint system, and we find that when the bounds are weak they can be improved by direct search optimization. We also derive upper and lower backward error bounds for the problem of least squares minimization over a sphere: min‖x‖2≤α ‖b− Ax‖2. AMS subject classification: 65F20
منابع مشابه
Superlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کاملEstimation of Backward Perturbation Bounds for Linear Least Squares Problem
Waldén, Karlson, and Sun found an elegant explicit expression of backward error for the linear least squares problem. However, it is difficult to compute this quantity as it involves the minimal singular value of certain matrix. In this paper we present a simple estimation to this bound which can be easily computed especially for large problems. Numerical results demonstrate the validity of the...
متن کاملOn the Solution of Constrained and Weighted Linear Least Squares Problems
Important problems in many scientific computational areas are least squares problems. The problem of constraint least squares with full column weight matrix is a class of these problems. In this presentation, we are concerned with the connection between the condition numbers and the rounding error in the solution of the problem of constrained and weighted linear least squares. The fact that thi...
متن کاملError Analysis of Elimination Methods for Equality Constrained Quadratic Programming Problems
A backward error analysis for the orthogonal factorization method for equality constrained quadratic programming problems has been developed. Furthermore, this method has been experimentally compared with direct elimination method on a class of test problems. 1 Statement of the problem We consider the equality constrained quadratic programming (QPE) problem min Cx=d 1 2 xAx+ bx+ ν (1) where C i...
متن کاملRow-Wise Backward Stable Elimination Methods for the Equality Constrained Least Squares Problem
It is well known that the solution of the equality constrained least squares (LSE) problem minBx=d ‖b−Ax‖2 is the limit of the solution of the unconstrained weighted least squares problem min x ∥∥ [ μd b ] − [ μB A ] x ∥∥ 2 as the weight μ tends to infinity, assuming that [B A ] has full rank. We derive a method for the LSE problem by applying Householder QR factorization with column pivoting t...
متن کامل